翻訳と辞書 |
knight's graph : ウィキペディア英語版 | knight's graph
In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an knight's tour graph is a knight's tour graph of an chessboard.〔.〕 For a knight's tour graph the total number of vertices is simply . For a knight's tour graph the total number of vertices is simply and the total number of edges is . A Hamiltonian path on the knight's tour graph is a knight's tour.〔 Schwenk's theorem characterizes the sizes of chessboard for which a knight's tour exist.〔.〕 ==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「knight's graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|